Michael Phelps Ward, 1925–2005
نویسندگان
چکیده
منابع مشابه
Analysis of the image repair discourse in the Michael Phelps controversy
The following study reviews the image repair strategies used byOlympic swimmerMichael Phelps, his sponsors and the organizations that govern him as an amateur swimmer after a picture of Phelps allegedly smoking from a marijuana pipe appeared in a British tabloid. Additionally, the study reviews media coverage of the controversy to determine whether Phelps was successful in repairing his image. ...
متن کاملOn the Phelps-Koopmans theorem
We examine whether the Phelps–Koopmans theorem is valid in models with nonconvex production technologies. We argue that a nonstationary path that converges to a capital stock above the smallest golden rule may indeed be efficient. This finding has the important implication that “capital overaccumulation” need not always imply inefficiency. Under mild regularity and smoothness assumptions, we pr...
متن کاملThe Phelps–Koopmans theorem and potential optimality
The Phelps–Koopmans theorem states that if every limit point of a path of capital stocks exceeds the “golden rule,” then that path is inefficient: there is another feasible path from the same initial stock that provides at least as much consumption at every date and strictly more consumption at some date. I show that in a model with nonconvex technologies and preferences, the theorem is false i...
متن کاملSQS-graphs of Solov'eva-Phelps codes
A binary extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ obtained via Solov’eva-Phelps doubling construction, where 9 ≥ κ ≥ 5. Each of the 361 resulting graphs has most of its nonloop edges expressible in...
متن کاملSQS-graph of Solov'eva-Phelps codes
A binary extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ obtained via Solov’eva-Phelps doubling construction, where 9 ≥ κ ≥ 5. Each of the 361 resulting graphs has most of its nonloop edges expressible in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wilderness & Environmental Medicine
سال: 2006
ISSN: 1080-6032
DOI: 10.1580/06-weme-or-019.1